The Finitistic Consistency of Heck's Predicative Fregean System
نویسندگان
چکیده
Frege’s theory is inconsistent (Russell’s paradox). However, the predicative version of Frege’s system is consistent. This was proved by Richard Heck in 1996 using a model theoretic argument. In this paper, we give a finitistic proof of this consistency result. As a consequence, Heck’s predicative theory is rather weak (as was suspected). We also prove the finitistic consistency of the extension of Heck’s theory to ∆1-comprehension and of Heck’s ramified predicative second-order system.
منابع مشابه
Francesca Boccuni On the Consistency of a Plural Theory of Frege ’ s
PG (Plural Grundgesetze) is a predicative monadic second-order system which is aimed to derive second-order Peano arithmetic. It exploits the notion of plural quantification and a few Fregean devices, among which the infamous Basic Law V. In this paper, a model-theoretical consistency proof for the system PG is provided.
متن کاملThe Constructive Hilbert Program and the Limits of Martin-Löf Type Theory
Hilbert’s program is one of the truly magnificent projects in the philosophy of mathematics. To carry out this program he founded a new discipline of mathematics, called “Beweistheorie”, which was to perform the task of laying to rest all worries about the foundations of mathematics once and for all1 by securing mathematics via an absolute proof of consistency. The failure of Hilbert’s finitist...
متن کاملThe Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program
After a brief flirtation with logicism in 1917–1920, David Hilbert proposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays and Wilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for ever stronger and more comprehensive areas of mathematics and ...
متن کاملEquations for Hereditary Substitution in Leivant's Predicative System F: A Case Study
This paper presents a case study of formalizing a normalization proof for Leivant’s Predicative System F [6] using the EQUATIONS package. Leivant’s Predicative System F is a stratified version of System F, where type quantification is annotated with kinds representing universe levels. A weaker variant of this system was studied by Stump & Eades [5, 3], employing the hereditary substitution meth...
متن کاملConsistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC)
In order to avoid well-know paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type0 : Type1 : · · · . Such type systems are called cumulative if for any type A we have that A : Typei implies A : Typei+1. The predicative calculus of inductive constructions (pCIC...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 56 شماره
صفحات -
تاریخ انتشار 2015